Subclasses of the Weakly Random Reals
نویسنده
چکیده
The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table degrees and then extend our analysis to the Schnorr random and hyperimmune reals.
منابع مشابه
Strong Jump-traceability I : the Computably Enumerable Case
Recent investigations in algorithmic randomness have lead to the discovery and analysis of the fundamental class K of reals called the K-trivial reals, defined as those whose initial segment complexity is identical with that of the sequence of all 1’s. There remain many important open questions concerning this class, such as whether there is a combinatorial characterization of the class and whe...
متن کاملDegrees of Weakly Computable Reals
A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...
متن کاملLogic Blog
1. Jan 2010: a downward GL1 set that is not weakly jump traceable 2 1.1. Original result 2 1.2. New results 2 1.3. Comments 2 2. March 2010: Structures that are computable almost surely 2 2.1. A structure that is computable almost surely, is computable in every Π1 random 2 2.2. Related questions 3 3. May 2010 : Cooper’s jump inversion and weak jump traceability 3 4. May 2010: The collection of ...
متن کاملGenericity and UD-random reals
Avigad introduced the notion of UD-randomness based in Weyl’s 1916 definition of uniform distribution modulo one. We prove that there exists a weakly 1-random real that is neither UD-random nor weakly 1-generic. We also show that no 2-generic real can Turing compute a UD-random real. 2000 Mathematics Subject Classification 03D32 (primary); 03D80 (secondary)
متن کاملCCC Forcing and Splitting Reals
Prikry asked if it is relatively consistent with the usual axioms of ZFC that every nontrivial ccc forcing adds either a Cohen or a random real. Both Cohen and random reals have the property that they neither contain nor are disjoint from an infinite set of integers in the ground model, i.e. they are splitting reals. In this note I show that that it is relatively consistent with ZFC that every ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 51 شماره
صفحات -
تاریخ انتشار 2010